package cn.pugle.oj.leetcode;

import cn.pugle.oj.catalog.GraphProblem;
import cn.pugle.oj.catalog.Unknown;

/**
 * 有多少个朋友圈
 * TODO dfs解法
 *
 * @author tzp
 * @since 2020/11/3
 */
public class LC547 implements GraphProblem {
    public int findCircleNum(int[][] M) {
        return 1;
    }

    public void dfs() {
    }

    public static void main(String[] args) {
        System.out.println(new LC547());
    }
}
